首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   13685篇
  免费   1511篇
  国内免费   931篇
化学   2678篇
晶体学   28篇
力学   1099篇
综合类   248篇
数学   8985篇
物理学   3089篇
  2024年   16篇
  2023年   109篇
  2022年   199篇
  2021年   293篇
  2020年   294篇
  2019年   325篇
  2018年   298篇
  2017年   463篇
  2016年   529篇
  2015年   359篇
  2014年   648篇
  2013年   1113篇
  2012年   696篇
  2011年   701篇
  2010年   637篇
  2009年   737篇
  2008年   822篇
  2007年   863篇
  2006年   796篇
  2005年   692篇
  2004年   630篇
  2003年   554篇
  2002年   570篇
  2001年   491篇
  2000年   420篇
  1999年   419篇
  1998年   336篇
  1997年   291篇
  1996年   262篇
  1995年   224篇
  1994年   178篇
  1993年   149篇
  1992年   153篇
  1991年   121篇
  1990年   89篇
  1989年   68篇
  1988年   64篇
  1987年   58篇
  1986年   61篇
  1985年   80篇
  1984年   72篇
  1983年   31篇
  1982年   40篇
  1981年   26篇
  1980年   26篇
  1979年   30篇
  1978年   15篇
  1977年   25篇
  1976年   17篇
  1974年   10篇
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
1.
2.
The purpose of this paper is to describe the oscillatory properties of second‐order Euler‐type half‐linear differential equations with perturbations in both terms. All but one perturbations in each term are considered to be given by finite sums of periodic continuous functions, while coefficients in the last perturbations are considered to be general continuous functions. Since the periodic behavior of the coefficients enables us to solve the oscillation and non‐oscillation of the considered equations, including the so‐called critical case, we determine the oscillatory properties of the equations with the last general perturbations. As the main result, we prove that the studied equations are conditionally oscillatory in the considered very general setting. The novelty of our results is illustrated by many examples, and we give concrete new corollaries as well. Note that the obtained results are new even in the case of linear equations.  相似文献   
3.
In this paper, we study the local linear convergence properties of a versatile class of Primal–Dual splitting methods for minimizing composite non-smooth convex optimization problems. Under the assumption that the non-smooth components of the problem are partly smooth relative to smooth manifolds, we present a unified local convergence analysis framework for these methods. More precisely, in our framework, we first show that (i) the sequences generated by Primal–Dual splitting methods identify a pair of primal and dual smooth manifolds in a finite number of iterations, and then (ii) enter a local linear convergence regime, which is characterized based on the structure of the underlying active smooth manifolds. We also show how our results for Primal–Dual splitting can be specialized to cover existing ones on Forward–Backward splitting and Douglas–Rachford splitting/ADMM (alternating direction methods of multipliers). Moreover, based on these obtained local convergence analysis result, several practical acceleration techniques are discussed. To exemplify the usefulness of the obtained result, we consider several concrete numerical experiments arising from fields including signal/image processing, inverse problems and machine learning. The demonstration not only verifies the local linear convergence behaviour of Primal–Dual splitting methods, but also the insights on how to accelerate them in practice.  相似文献   
4.
Necessary and sufficient conditions for qualitative properties of infinite dimensional linear programing problems such as solvability, duality, and complementary slackness conditions are studied in this article. As illustrations for the results, we investigate the parametric version of Gale’s example.  相似文献   
5.
Some formulas for well‐defined solutions to four very special cases of a nonlinear fifth‐order difference equation have been presented recently in this journal, where some of them were proved by the method of induction, some are only quoted, and no any theory behind the formulas was given. Here, we show in an elegant constructive way how the general solution to the difference equation can be obtained, from which the special cases very easily follow, which is also demonstrated here. We also give some comments on the local stability results on the special cases of the nonlinear fifth‐order difference equation previously publish in this journal.  相似文献   
6.
E. Casas  M. Mateos 《Optimization》2019,68(1):255-278
ABSTRACT

A class of semilinear parabolic reaction diffusion equations with multiple time delays is considered. These time delays and corresponding weights are to be optimized such that the associated solution of the delay equation is the best approximation of a desired state function. The differentiability of the mapping is proved that associates the solution of the delay equation to the vector of weights and delays. Based on an adjoint calculus, first-order necessary optimality conditions are derived. Numerical test examples show the applicability of the concept of optimizing time delays.  相似文献   
7.
In this paper, we define the generalised relative operator entropy and investigate some of its properties such as subadditivity and homogeneity. As application of our result, we obtain the information inequality. In continuation, we establish some reverses of the operator entropy inequalities under certain conditions by using the Mond–Pe?ari? method.  相似文献   
8.
Given two graphs and , a graph is -free if it contains no induced subgraph isomorphic to or . Let and be the path on vertices and the cycle on vertices, respectively. In this paper we show that for any -free graph it holds that , where and are the chromatic number and clique number of , respectively. Our bound is attained by several graphs, for instance, the 5-cycle, the Petersen graph, the Petersen graph with an additional universal vertex, and all -critical -free graphs other than (see Hell and Huang [Discrete Appl. Math. 216 (2017), pp. 211–232]). The new result unifies previously known results on the existence of linear -binding functions for several graph classes. Our proof is based on a novel structure theorem on -free graphs that do not contain clique cutsets. Using this structure theorem we also design a polynomial time -approximation algorithm for coloring -free graphs. Our algorithm computes a coloring with colors for any -free graph in time.  相似文献   
9.
10.
2017年,李昭祥等提出了一种偏牛顿-校正法(Partial Newton-Correction Method,简记为PNC方法),并利用它成功地计算出了三类非线性偏微分方程的多重不稳定解.本文在PNC方法的基础上,提出并发展了一种改进的PNC方法.首先,利用Nehari流形$\mathcal{N}$与零平凡解的可分离性,建立并证明了$\mathcal{N}$的某特殊子流形$\mathcal{M}$上的全局分离定理及其推广(即局部分离定理).全局分离定理只跟非线性偏微分算子或相应的非线性泛函本身有关,而与具体的计算方法无关.对一些典型的非线性偏微分方程多解问题(比如,Henon方程问题),该全局分离定理的分离条件,经验证是成立的.另一个方面,通过修改或补充原辅助变换的定义,去掉了原辅助变换的奇异性;接着建立并证明了某些非线性偏微分方程问题的新未知解与该非线性偏微分算子零核空间的密切关系;在证明中,去掉了在原奇异变换下所需的标准收敛(standard convergence)假设.最后,计算实例与数值结果验证了改进的PNC方法的可行性和有效性;同时表明子流形$\mathcal{M}$与已知解的可分离性是PNC方法和本文新方法能成功找到多解的关键.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号